Update Propagation in Deductive Databases Using Soft Stratification
نویسندگان
چکیده
Update propagation in deductive databases can be implemented by combining rule rewriting and fixpoint computation, analogous to the way how query answering is performed via Magic Sets. For efficiency reasons, bottom-up propagation rules have to be subject to Magic rewriting, thus possibly loosing stratifiability. We propose to use the soft stratification approach for computing the well-founded model of the magic propagation rules (guaranteed to be two-valued) because of the simplicity and efficiency of this technique.
منابع مشابه
Soft stratification for transformation-based approaches to deductive databases
The efficient evaluation of recursive views is a crucial issue in the research field of deductive databases. Results in this area are especially relevant for systems which will implement the new SQL:1999 standard, and hence will allow the definition of stratifiable recursive views. In particular, transformation-based solutions to query evaluation seem to be well-suited for extending existing re...
متن کاملA Uniform Fixpoint Approach to the Implementation of Inference Methods for Deductive Databases
Within the research area of deductive databases three different database tasks have been deeply investigated: query evaluation, update propagation and view updating. Over the last thirty years various inference mechanisms have been proposed for realizing these main functionalities of a rule-based system. However, these inference mechanisms have been rarely used in commercial DB systems until no...
متن کاملA Classification Scheme for Update Propagation Methods in Deductive Databases
Incremental view recomputation is a well-established research topic in deductive databases and plenty of update propagation methods have been proposed within the last two decades. All these approaches essentially apply the same propagation technique but differ in the way they are realized, the focus they provide to the induced changes and the granularity of the computed induced updates. In this...
متن کاملVI_SDB: a convivial approach for description and manipulation of deductive and stratified databases
Although deductive databases is based on a well established formalism, they didn't know the expected success. Their use was limited to the academic purpose. Indeed, the deductive database management systems are judged abstract, rare in commercial offers, and often expensive. In among the abstract concepts of the deductive databases, we mention the case of the negation and its treatment by the s...
متن کاملEfficient Computation of the Well-Founded Model Using Update Propagation
In this paper we present a bottom-up algorithm for computing the well-founded model of general normal logic programs by means of range-restricted Datalog : rules automatically generated from the source program. The drawback of repeated computation of facts from which Van Gelder's alternating xpoint procedure is suuering is avoided by using update propagation rules, generalizing the diierential ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004